Advanced OR and AI Methods in Transportation A HEURISTIC FOR THE ESTIMATION OF TIME-DEPENDENT ORIGIN–DESTINATION MATRICES FROM TRAFFIC COUNTS

نویسندگان

  • Jan LUNDGREN
  • Anders PETERSON
  • Clas RYDERGREN
چکیده

We consider the problem to estimate time-dependent origin– destination matrices from traffic counts. We propose an iterative algorithm, based on difference quotients, for expressing how the link flows are changed with respect to a change of the travel demand. The method is an extension to previously proposed methods for the time-independent case. It has been implemented together with the mesoscopic traffic assignment software Mezzo and tested for a network modeling the city of Stockholm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Moving Vehicle Tracking Using Disjoint View Multicameras

Multicamera vehicle tracking is a necessary part of any video-based intelligent transportation system for extracting different traffic parameters such as link travel times and origin/destination counts. In many applications, it is needed to locate traffic cameras disjoint from each other to cover a wide area. This paper presents a method for tracking moving vehicles in such camera networks. The...

متن کامل

The Origin–Destination Matrix Estimation Problem — Analysis and Computations

For most kind of analyses in the field of traffic planning, there is a need for origin– destination (OD) matrices, which specify the travel demands between the origin and destination nodes in the network. This thesis concerns the OD-matrix estimation problem, that is, the calculation of OD-matrices using observed link flows. Both time-independent and time-dependent models are considered, and we...

متن کامل

The Elevator Trip Origin-Destination Matrix Estimation Problem

We present a constraint programming formulation for the elevator trip origin-destination matrix estimation problem, and propose different approaches to solve the problem. An elevator trip consists of successive stops in one direction of travel with passengers inside the elevator. It can be defined as a directed network, where the nodes correspond to the stops on the trip, and the arcs to the po...

متن کامل

Different Network Performance Measures in a Multi-Objective Traffic Assignment Problem

Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...

متن کامل

Robustness and Computational Efficency of a Kalman Filter Estimator of Time Dependent Od Matrices Exploiting Ict Traffic Measurements

Origin-Destination (OD) trip matrices, which describe the patterns of traffic behavior across the network, are the primary data input used in principal traffic models and therefore, a critical requirement in all advanced systems that are supported by Dynamic Traffic Assignment models. However, because OD matrices are not directly observable, the current practice consists of adjusting an initial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005